Construction of Tree Automata from Regular Expressions
نویسندگان
چکیده
Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov’s partial derivatives from regular word expressions to regular tree expressions. For an analysis of the size of the resulting automaton as well as for algorithmic improvements, we also transfer the methods of Champarnaud and Ziadi from words to trees.
منابع مشابه
Multidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملAlgorithm for the k-Position Tree Automaton Construction
The word position automaton was introduced by Glushkov and McNaughton in the early 1960. This automaton is homogeneous and has (||E || + 1) states for a word expression of alphabetic width ||E ||. This kind of automata is extended to regular tree expressions. In this paper, we give an efficient algorithm that computes the Follow sets, which are used in different algorithms of conversion of a re...
متن کاملMetamorphosis of Fuzzy Regular Expressions to Fuzzy Automata using the Follow Automata
To deal with system uncertainty, finite automata have been generalized into fuzzy automata. Stamenkovic and Ciric proposed an approach using the position automata for the construction of fuzzy automata from fuzzy regular expressions. There exist multifarious methodologies for the construction of finite automata from regular expressions known as Thompson construction, Antimirov partial derivativ...
متن کاملLocal elimination-strategies in automata for shorter regular expressions
We propose a construction of regular expressions from particularly restricted NFA via extended automata. It proceeds in two main steps, elimination of cycles in the state graph followed by a recursive construction of the final regular expression. Inbetween these eliminations, series-parallel substructures are reduced to single transitions. The process gives rise to compact regular expressions b...
متن کاملGrail: A C++ Library for Automata and Expressions
Grail is a package for symbolic manipulation of nite-state automata and regular expressions. It provides most standard operations on automata and expressions, including minimization, subset construction, conversion between automata and regular expressions , and language enumeration and testing. Grail's objects are parameterizable; users can provide their own classes to deene the input alphabet ...
متن کامل